Fast segment insertion and incremental construction of constrained Delaunay triangulations
نویسندگان
چکیده
منابع مشابه
Restricted Constrained Delaunay Triangulations
We introduce the restricted constrained Delaunay triangulation (restricted CDT). The restricted CDT generalizes the restricted Delaunay triangulation, allowing us to define a triangulation of a surface that includes a set of constraining segments. Under certain sampling conditions, the restricted CDT includes every constrained segment and suggests an algorithm that produces a triangulation of t...
متن کاملConstrained Delaunay Triangulations and Algorithms
Two-dimensional constrained Delaunay triangulations (of a planar straight-linegraph) introduced independently by Lee et al. [2] and Chew [1] are well studied struc-tures and can be constructed in optimal time. However, the generalization of suchobjects to three and higher dimensions is much less discussed in literature.In this talk, we first define a constrained Delaunay tri...
متن کاملI/O-Efficient Construction of Constrained Delaunay Triangulations
In this paper, we designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations. If the number of constraining segments is smaller than the memory size, our algorithm runs in expected O(NB logM/B N B ) I/Os for triangulating N points in the plane, where M is the memory size and B is the disk block size. If there are more constraining segments, the theo...
متن کاملConstrained higher order Delaunay triangulations
We extend the notion of higher-order Delaunay triangulations to constrained higherorder Delaunay triangulations and provide various results. We can determine the order k of a given triangulation in O(min(nk log n log k, n log n)) time. We show that the completion of a set of useful order-k Delaunay edges may have order 2k − 2, which is worst-case optimal. We give an algorithm for the lowest-ord...
متن کاملComputing directional constrained Delaunay triangulations
This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in Vig97] and Vig95]. While the rst generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated to each point of the plane. The pseudo-code of the procedures involved in the algorithms is included, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2015
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.04.006